🚦 Wait-Free Algorithms - hello · Scour

CPU-less parallel execution of lambda calculus in digital logic

arxiv.org·15h

🔓Lock-Free Programming

What we learned building an onchain DEX without tradeoffs

dev.to·11h·

Discuss: DEV

ES6 Generators Deliver Go Style Concurrency

swannodette.github.io·18h

Non-Haar Random Circuits form Unitary Designs as Fast as Haar Random Circuits

link.aps.org·9h

🔀Procedural Generation

Clockworker: single-threaded async executor with powerful scheduling to sit on top of async runtimes

github.com·1d·

Discuss: r/rust

⚡Tokio Runtime

Binary Algorithms

exystence.net·20h

⏭️Skip Lists

On rebuilding read models, Dead-Letter Queues and Why Letting Go is Sometimes the Answer

event-driven.io·2d·

Discuss: r/programming

💳Transactional Memory

Building scalable agentic assistants: A graph-based approach

thenewstack.io·2h

Making an LSP for great good

thunderseethe.dev·20h·

Discuss: Lobsters, Hacker News

Thinking Traps in Long Chain-of-Thought: A Measurable Study and Trap-Aware Adaptive Restart

arxiv.org·15h

🔄Memory Ordering

techtalksweekly.io·5h

Silent Agreement Evaluation

lesswrong.com·2d

Scientific Computing in Rust Monthly #14

scientificcomputing.rs·8h

🦀Rust Macros

I Made Zig Compute 33 Million Satellite Positions in 3 Seconds. No GPU Required.

atempleton.dev·1d·

Discuss: Hacker News

Constraints Not Loops: Building Features in Reverse

coey.dev·20h

📝Parser Combinators

On the way to step functions: the two worlds

blog.julik.nl·1d

⏱️Temporal Workflow

FlashAttention 4: Faster, Memory-Efficient Attention for LLMs

digitalocean.com·8h

🔄Hardware Transactional Memory

Rigorous Lower Bound on Dynamical Exponents in Gapless Frustration-Free Systems

link.aps.org·13h

🔓Lock-Free Programming

Rust async combinators for elegant and secure concurrency

kerkour.com·14h·

Discuss: r/rust

Real-Time Data Stream Processing in Go: Backpressure, Windowing, and Fault Tolerance Explained

dev.to·6h·

Discuss: DEV

⏰Timely Dataflow

Loading more...